Optimal Gradient Clock Synchronization in Dynamic Networks (Technical Report) Fabian Kuhn1 Christoph Lenzen2

Source URL: disco.ethz.ch

• Clock signal
• Clock skew
• Flow network
• Network flow
• Routing algorithms
• FordFulkerson algorithm

Adaptive Collective Routing Using Gaussian Process Dynamic Congestion Models Siyuan Liu, Yisong Yue, Ramayya Krishnan Carnegie Mellon University {siyuan,yisongyue,rk2x}@cmu.edu

Source URL: www.utc.ices.cmu.edu

• Algebra of random variables
• Covariance and correlation
• Routing
• Covariance
• Shortest path problem
• Multivariate statistics
• Kalman filter

COMPUTING SHORTEST PATHS USING SPARSE GAUSSIAN ELIMINATION Aydın Bulu¸c, John Gilbert, Sivan Toledo SIAM Workshop on Network Science 2014 July 6-7 · Chicago For example, U ∗ encodes the paths from lower numbered

Source URL: siam.org

• Routing algorithms
• Network theory
• Graph theory
• Graph connectivity
• Dynamic programming
• FloydWarshall algorithm
• Shortest path problem
• Distance
• Path
• Planar separator theorem
• Edge disjoint shortest pair algorithm

Microsoft Word - [en] Sujet thèse multichemins 2014.docx

Source URL: icube-reseaux.unistra.fr

• Routing algorithms
• Routing
• Telecommunications engineering
• Multipath routing
• Computer networking
• IP forwarding
• Link-state routing protocol
• Computer network
• Dynamic routing
• Router
• Equal-cost multi-path routing
• Adaptive quality of service multi-hop routing

Web Intelligence and Virtual Entreprise, xxxx 1 Improving dynamic skills searching in virtual social communities using agent’s network

Source URL: wic.litislab.fr

• Network theory
• Systems theory
• Social networks
• Networks
• Complex systems theory
• Agent-based model
• Social network
• Routing
• Centrality
• Social simulation
• Network science
• Social network analysis software

Towards an Information-Centric Delay-Tolerant Network Gareth Tyson, John Bigham and Eliane Bodanese School of Electronic Engineering and Computer Science, Queen Mary, University of London, UK Abstract—Information-centr

Source URL: www.eecs.qmul.ac.uk

• Network protocols
• Computer networking
• Wireless networking
• Delay-tolerant networking
• Network architecture
• Routing
• Interplanetary Internet
• Wireless ad hoc network
• ICN
• Computer network
• Content centric networking
• Dynamic routing

Adaptive Collective Routing Using Gaussian Process Dynamic Congestion Models Siyuan Liu, Yisong Yue, Ramayya Krishnan Carnegie Mellon University {siyuan,yisongyue,rk2x}@cmu.edu

Source URL: select.cs.cmu.edu

• Statistics
• Probability theory
• Algebra of random variables
• Covariance and correlation
• Routing
• Covariance
• Shortest path problem
• Mathematics
• Multivariate statistics
• Kalman filter

Adaptive Collective Routing Using Gaussian Process Dynamic Congestion Models Siyuan Liu, Yisong Yue, Ramayya Krishnan Carnegie Mellon University {siyuan,yisongyue,rk2x}@cmu.edu

Source URL: www.yisongyue.com

GeoDTN+Nav: A Hybrid Geographic and DTN Routing with Navigation Assistance in Urban Vehicular Networks∗ P.-C. Cheng‡ , J.-T. Weng‡ , L.-C. Tung‡ , K. C. Lee‡ , M. Gerla‡ , J. Härri Computer Science Departmen

Source URL: irl.cs.ucla.edu

• Routing
• Computer networking
• Network protocols
• Wireless networking
• Delay-tolerant networking
• Geographic routing
• Packet switching
• Hop
• Network packet
• Dynamic Source Routing

A PARTICLE SWARM OPTIMIZATION HYPER-HEURISTIC FOR THE DYNAMIC VEHICLE ROUTING PROBLEM Michal Okulewicz, Jacek Ma´ ndziuk Faculty of Mathematics and Information Science, Warsaw University of Technology,

Source URL: bioma.ijs.si

• Operations research
• Mathematical optimization
• Mathematics
• Applied mathematics
• Computational complexity theory
• NP-complete problems
• Cybernetics
• Evolutionary algorithms
• Ant colony optimization algorithms
• Particle swarm optimization
• Swarm intelligence
• Hyper-heuristic